Symmetric Rendezvous Search on the Line using Move Patterns with Different Lengths
نویسنده
چکیده
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to define mixed (randomized) strategies, and formalize a general scheme to compute the expected rendezvous time of mixed strategies. We introduce a strategy that has the following properties: (1) move patterns have different lengths, and (2) the probability of choosing a move pattern in the current round depends on move pattern used in the previous round. The expected rendezvous time of our strategy is 4.39306. We also introduce a scheme to compute lower bounds for the expected rendezvous value under a certain assumption. We use the scheme to obtain a lower bound of 3.95460. This is the first non-trivial lower bound for the problem.
منابع مشابه
Optimal Symmetric Rendezvous Search on Three Locations
In the symmetric rendezvous search game played on n locations two players are initially placed at two distinct locations. The game is played in discrete steps, at each of which each player can either stay where he is or move to a different location. The players share no common labelling of the locations. We wish to find a strategy such that, if both players follow it independently, then the exp...
متن کاملRendezvous Search with Revealed Information: Applications to the Line
The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q: This minimum is called the (symmetric) rendezvous valueof Q: Traditionally, the players are assumed to receive no information during the play of the game. We consider the e¤ect on re...
متن کامل0 Ju n 20 09 The optimal strategy for symmetric rendezvous search on K 3
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). The game is played in discrete steps and at each step each player can either stay where he is or move to a different location. The players share no common labelling of the locations. They wish to minimize the expected n...
متن کاملThe optimal strategy for symmetric rendezvous search on K3
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). The game is played in discrete steps and at each step each player can either stay where he is or move to a different location. The players share no common labelling of the locations. They wish to minimize the expected n...
متن کاملRendezvous Search with Revealed Information: Applications to the Line
The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’ofQ. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezv...
متن کامل